Preference for fixed over variable access to food
نویسندگان
چکیده
منابع مشابه
fixed point property for banach algebras associated to locally compact groups
در این پایان نامه به بررسی خاصیت نقطه ثابت و خاصیت نقطه ثابت برای نیم گروههای برگشت پذیر چپ روی بعضی جبرهای باناخ از جمله جبر فوریه و جبر فوریه استیلتیس پرداخته شده است. برای مثال بیان شده است که اگر گروه یک گروه فشرده موضعی با همسایگی فشرده برای عنصر همانی که تحت درونریختی ها پایاست باشد آنگاه جبر فوریه و جبر فوریه استیلتیس دارای خاصیت نقطه ثابت برای نیم گروه های برگشت پذیر چپ است اگر و تنها ا...
15 صفحه اولKey Principles for Wholesale Access over Next Generation Fixed Networks
The continuing trend of increasing broadband adoption and utilisation is driving the deployment of technologies with greater capabilities based on fibre deployment and widely referred to as Next Generation Access (NGA). Among the wire-line operators (as opposed to cable or mobile operators), the dominant technologies used for NGA will be VDSL2 or Fibre to the Premises (FTTP). FTTP can be via ei...
متن کاملVariable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملVariable Forgetting in Preference Relations over Propositional Domains
Representing (and reasoning about) preference relations over combinatorial domains is computationally expensive. We argue that for many problems involving such preferences, it is relevant to simplify them by projecting them on a subset of variables. We investigate several possible definitions, focusing without loss of generality on propositional (binary) variables. We then define the notion of ...
متن کاملProbabilistic Models over Weighted Orderings: Fixed-Parameter Tractable Variable Elimination
Probabilistic models with weighted formulas, known as Markov models or log-linear models, are used in many domains. Recent models of weighted orderings between elements that have been proposed as flexible tools to express preferences under uncertainty, are also potentially useful in applications like planning, temporal reasoning, and user modeling. Their computational properties are very differ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Animal Learning & Behavior
سال: 1979
ISSN: 0090-4996,1532-5830
DOI: 10.3758/bf03209709